Classification of Acceptance Criteria for the Simulated Annealing Algorithm
نویسندگان
چکیده
منابع مشابه
Classification of Acceptance Criteria for the Simulated Annealing Algorithm
We present a complete and explicit description of the class of all acceptance criteria for the simulated annealing algorithm that are uniformly and locally cost dependent and that lead to reversibility when combined with a symmetric generation matrix. In particular we identify the subclass consisting of those acceptance criteria that depend uniformly on the difference in cost. Furthermore, we p...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملComparative Analysis of Threshold Acceptance Algorithm, Simulated Annealing Algorithm and Genetic Algorithm for Function Optimization
The goal of this study of threshold acceptance algorithm (TA), simulated annealing algorithm (SA) and genetic algorithm (GA) is to determine strength of Genetic Algorithm over other algorithm. It gives a clear idea of how genetic algorithm works. It gives the idea of various sub methods used in genetic algorithm to improve the results and outcome. Basically genetic algorithm and all traditional...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملa new simulated annealing algorithm for the robust coloring problem
the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1997
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.22.2.266